Approximation of Minimum Cost Homomorphisms
نویسندگان
چکیده
Let H be a fixed graph without loops. We prove that if H is a co-circular arc bigraph then the minimum cost homomorphism problem to H admits a polynomial time constant ratio approximation algorithm; otherwise the minimum cost homomorphism problem to H is known to be not approximable. This solves a problem posed in an earlier paper. For the purposes of the approximation, we provide a new characterization of co-circular arc bigraphs by the existence of min ordering. Our algorithm is then obtained by derandomizing a two-phase randomized procedure. We show a similar result for graphs H in which all vertices have loops: if H is an interval graph, then the minimum cost homomorphism problem to H admits a polynomial time constant ratio approximation algorithm, and otherwise the minimum cost homomorphism problem to H is not approximable.
منابع مشابه
Approximation of Jordan homomorphisms in Jordan Banach algebras RETRACTED PAPER
In this paper, we investigate the generalized Hyers-Ulam stability of Jordan homomorphisms in Jordan Banach algebras for the functional equation begin{align*} sum_{k=2}^n sum_{i_1=2}^ksum_{i_2=i_{1}+1}^{k+1}cdotssum_{i_n-k+1=i_{n-k}+1}^n fleft(sum_{i=1,i not=i_{1},cdots ,i_{n-k+1}}^n x_{i}-sum_{r=1}^{n-k+1} x_{i_{r}}right) + fleft(sum_{i=1}^{n}x_{i}right)-2^{n-1} f(x_{1}) =0, end{align*} where ...
متن کاملFixed point approach to the Hyers-Ulam-Rassias approximation of homomorphisms and derivations on Non-Archimedean random Lie $C^*$-algebras
In this paper, using fixed point method, we prove the generalized Hyers-Ulam stability of random homomorphisms in random $C^*$-algebras and random Lie $C^*$-algebras and of derivations on Non-Archimedean random C$^*$-algebras and Non-Archimedean random Lie C$^*$-algebras for the following $m$-variable additive functional equation: $$sum_{i=1}^m f(x_i)=frac{1}{2m}left[sum_{i=1}^mfle...
متن کاملThe Dichotomy of Minimum Cost Homomorphism Problems for Digraphs
The minimum cost homomorphism problem has arisen as a natural and useful optimization problem in the study of graph (and digraph) coloring and homomorphisms: it unifies a number of other well studied optimization problems. It was shown by Gutin, Rafiey, and Yeo that the minimum cost problem for homomorphisms to a digraph H that admits a so-called extended MinMax ordering is polynomial time solv...
متن کاملApproximation of a generalized Euler-Lagrange type additive mapping on Lie $C^{ast}$-algebras
Using fixed point method, we prove some new stability results for Lie $(alpha,beta,gamma)$-derivations and Lie $C^{ast}$-algebra homomorphisms on Lie $C^{ast}$-algebras associated with the Euler-Lagrange type additive functional equation begin{align*} sum^{n}_{j=1}f{bigg(-r_{j}x_{j}+sum_{1leq i leq n, ineq j}r_{i}x_{i}bigg)}+2sum^{n}_{i=1}r_{i}f(x_{i})=nf{bigg(sum^{n}_{i=1}r_{i}x_{i}bigg)} end{...
متن کاملMinimum Cost Homomorphisms with Constrained Costs
Minimum cost homomorphism problems can be viewed as a generalization of list homomorphism problems. They also extend two well-known graph colouring problems: the minimum colour sum problem and the optimum cost chromatic partition problem. In both of these problems, the cost function meets an additional constraint: the cost of using a specific colour is the same for every vertex of the input gra...
متن کامل